Words in linear groups, random walks, automata and P-recursiveness
نویسندگان
چکیده
منابع مشابه
Words in Linear Groups, Random Walks, Automata and P-recursiveness
Fix a finite set S ⊂ GL(k,Z). Denote by an the number of products of matrices in S of length n that are equal to 1. We show that the sequence {an} is not always P-recursive. This answers a question of Kontsevich.
متن کاملRandom Walks in Cellular Automata
Topological defects or phase boundaries discerned in a number of one-dimensional cellular automata appear to perform random walks as well as simpler motions. We analyze their properties rigorously using probabilistic methods. This results in a complete classi cation in the partially permutive case. The paper complements [1] where the general framework of tilings and subpermutivity was introduce...
متن کاملRandom Walks in Compact Groups
Let X1, X2, . . . be independent identically distributed random elements of a compact group G. We discuss the speed of convergence of the law of the product Xl · · ·X1 to the Haar measure. We give poly-log estimates for certain finite groups and for compact semi-simple Lie groups. We improve earlier results of Solovay, Kitaev, Gamburd, Shahshahani and Dinai. 2010 Mathematics Subject Classificat...
متن کاملRandom Walks on Finite Groups
Markov chains on finite sets are used in a great variety of situations to approximate, understand and sample from their limit distribution. A familiar example is provided by card shuffling methods. From this viewpoint, one is interested in the “mixing time” of the chain, that is, the time at which the chain gives a good approximation of the limit distribution. A remarkable phenomenon known as t...
متن کاملRandom walks in large finite groups
of random element is described means of ac<:oumtimg retllres:enl:ati'ves of certain of elements in finite groups (when the Pf()dllctilon or of such classes is restricted by the available cOlmputing resources), in the context of the some of the sp()ra,dlC finite groups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Algebra
سال: 2017
ISSN: 2415-6302
DOI: 10.4171/jca/1-2-1